Optimising Description Logic Subsumption
نویسندگان
چکیده
Effective optimisation techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. With currently-available desktop computers, systems that incorporate these techniques can effectively reason in description logics with intractable inference. Because of the correspondence between description logics and propositional modal logic, difficult problems in propositional modal logic can be effectively solved using the same techniques.
منابع مشابه
Optimising Propositional Modal Satisfiability for Description Logic Subsumption
Effective optimisation techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. Because of the correspondence between description logics and propositional modal logic many of these techniques carry over into propositional modal logic satisfiability checking. Currently-implemented representation systems that employ t...
متن کاملEmpirical Investigation of Subsumption Test Hardness in Description Logic Classification
Recently, modular techniques have been employed for optimising Description Logic reasoning, specifically to enable incremental reasoning and improve overall classification time. Classifying a module of an ontology should be significantly easier than reasoning in the whole ontology. However, we observed in previous work that neither it is generally true that modular reasoning techniques have a r...
متن کاملComparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence between description logics and propositional modal logic most of these techniques carry over into propositional modal logic satisfiability checking. Some of the techniques are extremely effective on various test suite...
متن کاملSubsumption of Concepts in FL0y for (Cyclic) Terminologies with Respect to Descriptive Semantics is PSPACE-complete
We close the gap in complexity classification of the subsumption problem in the simple description logic FL0, which allows for conjunctions and universal value restriction only. We prove that subsumption in FL0 is PSPACE-complete when cyclic definitions with descriptive semantics are allowed. Our proof uses automata theory and as a by-product the PSPACE-completeness of a certain decision proble...
متن کاملInverting Subsumption for Constructive Reasoning
We present a Logic Programming prototype implementation, working as proof-of-concept for a unified strategy proposed in our past research to solve several non-standard reasoning problems in Description Logics (DLs), denoted by Constructive Reasoning. In order to prove both the problem-independence and the logic-independence of the adopted approach, the prototype is focused on the solution of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998